Repeated-root constacyclic codes of length 4ℓp
نویسندگان
چکیده
منابع مشابه
Repeated-root constacyclic codes of length slmpn
For any different odd primes ` and p, structure of constacyclic codes of length 2`p over the finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, the characterization and enumeration of all linear complimentary dual and self-dual constacylic codes of length 2`p are obtained.
متن کاملRepeated-root constacyclic codes of length $2\ell^mp^n$
For any different odd primes l and p, structure of constacyclic codes of length 2lp over a finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, all linear complimentary dual and self-dual constacyclic codes of length 2lp over Fq are obtained.
متن کاملOn Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields
In this paper we investigate the structure of repeated root constacyclic codes of length 2mp over Fps with a ≥ 1 and (m, p) = 1. We characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes. Further, we gave cases where the constacyclic codes are equivalent to cyclic codes.
متن کاملPolycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p,m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding ...
متن کاملTwo generalizations on the minimum Hamming distance of repeated-root constacyclic codes
We study constacyclic codes, of length np and 2np, that are generated by the polynomials (x+γ) and (x−ξ)(x+ξ) respectively, where x+γ, x−ξ and x+ξ are irreducible over the alphabet Fpa . We generalize the results of [5], [6] and [7] by computing the minimum Hamming distance of these codes. As a particular case, we determine the minimum Hamming distance of cyclic and negacyclic codes, of length ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2016
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2016.04.001